Algorithmic Transparency of Large-Scale *AIDA Programs
نویسندگان
چکیده
منابع مشابه
Name Transparency in Very Large Scale Distributed File Systems
Previous distributed le systems have relied on either convention or obtaining dynamic global agreement to provide network transparent le naming. This paper argues that neither approach can succeed as systems scale to the kind of size that is anticipated in the current decade. We propose instead a novel name mapping scheme which relies on a fragmented, selectively replicated name translation dat...
متن کاملFinding Bottlenecks in Large Scale Parallel Programs
This thesis addresses the problem of trying to locate the source of performance bottlenecks in large-scale parallel and distributed applications. Performance monitoring creates a dilemma: identifying a bottleneck necessitates collecting detailed information, yet collecting all this data can introduce serious data collection bottlenecks. At the same time, users are being inundated with volumes o...
متن کاملSolving large-scale semidefinite programs in parallel
We describe an approach to the parallel and distributed solution of large-scale, block structured semidefinite programs using the spectral bundle method. Various elements of this approach (such as data distribution, an implicitly restarted Lanczos method tailored to handle block diagonal structure, a mixed polyhedralsemidefinite subdifferential model, and other aspects related to parallelism) a...
متن کاملSdpa Project : Solving Large-scale Semidefinite Programs
The Semidefinite Program (SDP) has recently attracted much attention of researchers in various fields for the following reasons: (i) It has been intensively studied in both theoretical and numerical aspects. Especially the primal-dual interior-point method is known as a powerful tool for solving large-scale SDPs with accuracy. (ii) Many practical problems in various fields such as combinatorial...
متن کاملSteepest Ascent for Large - Scale Linear Programs
Many structured large-scale linear programming problems can be transformed into an equivalent problem of maximizing a piecewise linear, concave function subject to linear constraints. The equivalent problem can, in turn, be solved in a finite number of steps using a steepest ascent algorithm. This principle is applied to block diagonal systems yielding refinements of existing algorithms. An app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Software Engineering and Knowledge Engineering
سال: 2020
ISSN: 0218-1940,1793-6403
DOI: 10.1142/s0218194020500345